منابع مشابه
Sampling Methods for Random Subspace Domain Adaptation
Supervised classification tasks like Sentiment Analysis or text classification need labelled training data. These labels can be difficult to obtain, especially for complicated and ambiguous data like texts. Instead of labelling new data, domain adaptation tries to reuse already labelled data from related tasks as training data. We propose a greedy selection strategy to identify a small subset o...
متن کاملSubspace estimation using unitary Schur-type methods
This paper presents efficient Schur–type algorithms for estimating the column space (signal subspace) of a low rank data matrix corrupted by additive noise. Its computational structure and complexity are similar to that of an LQ–decomposition, except for the fact that plane and hyperbolic rotations are used. Therefore, they are well suited for a parallel (systolic) implementation. The required ...
متن کاملShort-Term Load Forecasting Using Random Forests
This study proposes using a random forest model for short-term electricity load forecasting. This is an ensemble learning method that generates many regression trees (CART) and aggregates their results. The model operates on patterns of the time series seasonal cycles which simplifies the forecasting problem especially when a time series exhibits nonstationarity, heteroscedasticity, trend and m...
متن کاملEstimating linear dynamical models using subspace methods
1 Introduction 2 General setup: We are given a dataset of (multivariable) input (u t ∈ R m) and (multivariable) output (y t ∈ R s) measurements (classified) at discrete time instants t = 1,. .. , T. We want to estimate a linear dynamical model describing the data set and obtain accuracy measures for the purposes of • prediction • simulation • validation of Theory We do not have any knowledge on...
متن کاملDenoising using local projective subspace methods
In this paper we present denoising algorithms for enhancing noisy signals based on Local ICA (LICA), Delayed AMUSE (dAMUSE) and Kernel PCA (KPCA). The algorithm LICA relies on applying ICA locally to clusters of signals embedded in a high dimensional feature space of delayed coordinates. The components resembling the signals can be detected by various criteria like estimators of kurtosis or the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Econometrics
سال: 2019
ISSN: 0304-4076
DOI: 10.1016/j.jeconom.2019.01.009